Mixing Time of the Rudvalis Shuffle
نویسنده
چکیده
We extend a technique for lower-bounding the mixing time of card-shuffling Markov chains, and use it to bound the mixing time of the Rudvalis Markov chain, as well as two variants considered by Diaconis and Saloff-Coste. We show that in each case Θ(n log n) shuffles are required for the permutation to randomize, which matches (up to constants) previously known upper bounds. In contrast, for the two variants, the mixing time of an individual card is only Θ(n) shuffles.
منابع مشابه
The overhand shuffle mixes in Θ(n log n) steps
The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [5] who showed that the mixing time with respect to variation distance is at least of order n2 and at most of order n2 log n. In this paper we use an extension of a lemma of Wilson [7] to establish a ...
متن کاملThe Overhand Shuffle Mixes in Θ ( N 2 Log N ) Steps
The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [J. Theoret. Probab. 2 (1989) 37–49] who showed that the mixing time with respect to variation distance is at least of order n and at most of order n logn. In this paper we use an extension of a lemma...
متن کاملThe overhand shuffle mixes in Θ ( n 2 log n ) steps Johan
The overhand shuffle is one of the “real” card shuffling methods in the sense that some people actually use it to mix a deck of cards. A mathematical model was constructed and analyzed by Pemantle [4] who showed that the mixing time with respect to variation distance is at least of order n2 and at most of order n2 log n. In this paper we use an extension of a lemma of Wilson [6] to establish a ...
متن کاملAnalysis of Top to Bottom - K Shuffles 3
A deck of n cards is shuffled by repeatedly moving the top card to one of the bottom kn positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as kn ranges from a constant to n. We also consider a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom kn positions or a random car...
متن کاملBiased random-to-top shuffling
Recently Wilson [12] introduced an important new technique for lower bounding the mixing time of a Markov chain. In this paper we extend Wilson’s technique to find lower bounds of the correct order for card shuffling Markov chains where at each time step a random card is picked and put at the top of the deck. Two classes of such shuffles are addressed, one where the probability that a given car...
متن کامل